منابع مشابه
Constructions of algebraic lattices
In this work we present constructions of algebraic lattices in Euclidean space with optimal center density in dimensions 2, 3, 4, 6, 8 and 12, which are rotated versions of the lattices 3n , for n = 2, 3, 4, 6, 8 and K12. These algebraic lattices are constructed through twisted canonical homomorphism via ideals of a ring of algebraic integers. Mathematical subject classification: 18B35, 94A15, ...
متن کاملAlgebraic Properties of Intuitionistic Fuzzy Residuated Lattices
In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...
متن کاملConstructions of Pseudorandom Binary Lattices
Three constructions for binary lattices with strong pseudorandom properties are given. These constructions are the two dimensional extensions and modifications of three of the most important one dimensional constructions. The upper estimates for the pseudorandom measures of the binary lattices constructed are based on the principle that character sums in two variables can be estimated by fixing...
متن کاملAlgebraic Lattices
Let L be a non empty reflexive relational structure. The functor CompactSublatt(L) yields a strict full relational substructure of L and is defined as follows: (Def. 1) For every element x of L holds x ∈ the carrier of CompactSublatt(L) iff x is compact. Let L be a lower-bounded non empty reflexive antisymmetric relational structure. Observe that CompactSublatt(L) is non empty. Next we state th...
متن کاملThe Calculus of algebraic Constructions
This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive recursion, by providing definitions of functions by patternmatching which capture recursor definitions for arbitrary non-dependent and non-polymorphic inductive t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2010
ISSN: 1807-0302
DOI: 10.1590/s1807-03022010000300010